Parallel ear decomposition search (EDS) and st-numbering in graphs
نویسندگان
چکیده
منابع مشابه
Parallel Ear Decomposition
LEC-67] linear time serial algorithm for testing planarity of graphs uses the linear time serial algorithm of [ET-76] for st-numbering. This st-numbering algorithm is based on depth-first search (DFS). A known conjecture states that DFS, which is a key technique in designing serial algorithms, is not amenable to poly-log time parallelism using "around linearly" (or even polynomially) many proce...
متن کاملBiconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014) reconsidered classical fundamental graph algorithms focusing on improving the space complexity. Elmasry et al. gave, among others, an implementation of depth first search (DFS) of a graph on n vertices and m edges, taking O(m lg lgn) time1 using O(n) bits of space improving on the time bound of O(m lgn) due to Asano et al....
متن کاملParallel Decomposition of Generalized Series-Parallel Graphs
Received July 17, 1997; accepted May 1, 1998. Communicated by Wen-Lian Hsu. *A preliminary version of this paper appeared in the proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’97) Las Vegas, Nevada, pp. 890-896, 1997. Research supported in part by NSC under Grant 83-0408-E-008-004. JOURNAL OF INFORMATION SCIENCE AND ENGINEER...
متن کاملAn Experimental Comparison of Parallel Algorithms for Ear Decomposition of Graphs using Two Leading Paradigms
Graph decomposition is an important and necessary operation when solving graph-theoretic problems on parallel computers, for instance, from computational fluid dynamics, mechanics, and astrophysics. In this paper, we design and analyze message-passing and shared-memory parallel algorithms that efficiently decompose a planar graph into a number of ears, known as the Ear Decomposition. This decom...
متن کاملNumbering action vertices in workflow graphs
Workflow graphs, consisting of actions, events, and logical switches, are used to model business processes. In order to easily identify the actions within a workflow graph, it is useful to number them in such a way that the numbering reflects the structure of the workflow. However, available tools offer only rudimental numbering schemes. In the paper, a set of natural requirements is defined th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90153-2